This P2P network has less average shortest path length with better scalability and robustness.

由此构造的P 2 P网络具有较小的平均最短路径长度、良好的可扩展性和鲁棒性。

youdao

A new algorithm is proposed, which solves the shortest path in a graph with the same length of the edges.

最后，全面阐述图的最短路径算法，提出改进算法，有效地解决了含有多条相同长度的单源点最短路径问题；

youdao

To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution.

为了求解上述模型，首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度，然后设计了捕食搜索算法对模型进行求解。

youdao